Decoding interleaved Reed–Solomon codes over noisy channels
نویسندگان
چکیده
منابع مشابه
Decoding interleaved Reed-Solomon codes over noisy channels
We consider error-correction over the Non-Binary Symmetric Channel (NBSC) which is a natural probabilistic extension of the Binary Symmetric Channel (BSC). We propose a new decoding algorithm for interleaved Reed-Solomon Codes that attempts to correct all “interleaved” codewords simultaneously. In particular, interleaved encoding gives rise to multi-dimensional curves and more specifically to a...
متن کاملDecoding of Interleaved Reed Solomon Codes over Noisy Data
We consider error-correction over the Non-Binary Symmetric Channel (NBSC) which is a natural probabilistic extension of the Binary Symmetric Channel (BSC). We propose a new decoding algorithm for interleaved Reed-Solomon Codes that attempts to correct all “interleaved” codewords simultaneously. In particular, interleaved encoding gives rise to multi-dimensional curves and more specifically to a...
متن کاملEfficient MMSE Source Decoding Over Noisy Channels
Exploiting the residual redundancy in a source coder output stream during the decoding process has been proven to be a bandwidth efficient way to combat the noisy channel degradations. Researchers have recently developed techniques to employ this redundancy to either assist the channel decoder for improved performance or design better source decoders. However, the method used for modeling the r...
متن کاملAnalysis of soft decision decoding of interleaved convolutional codes over burst channels
We study the performance of a decision feedback decoder (DFD) for convolutional codes over an interleaved burst channel. The DFD adaptively estimates channel reliability information from previous decisions. The effect of ermr propagation, finite interleaving and the length of the initial training sequence is explicitly studied. A binary Gilbert-Elliott channel is used to model the wmla t ion st...
متن کاملIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.043